Efficient run-time type checking of typed logic programs
نویسندگان
چکیده
منابع مشابه
Run-Time Type Checking for Binary Programs
Many important software systems are written in the C programming language. Unfortunately, the C language does not provide strong safety guarantees, and many common programming mistakes introduce type errors that are not caught by the compiler. These errors only manifest themselves at run time through unexpected program behavior, and it is often hard to isolate and identify their causes. This pa...
متن کاملType Inference and Checking for POS-typed Funtional Logic Programs
In this paper we investigate the type inference and checking for a polymorphic order-sorted typed functional logic language. This language consists of a speciication of types, a set of type declarations for data constructors and functions and a set of constructor-based conditional rewriting rules including data and type conditions as constraints in the rule applicability. We have interested in ...
متن کاملRun-Time Profiling of Functional Logic Programs
In this work, we introduce a profiling scheme for modern functional logic languages covering notions like laziness, sharing, and non-determinism. Firstly, we instrument a natural (big-step) semantics in order to associate a symbolic cost to each basic operation (e.g., variable updates, function unfoldings, case evaluations). While this cost semantics provides a formal basis to analyze the cost ...
متن کاملRun-time Manipulation of Programs in a Statically-Typed Language
This article is an extended abstract of a doctoral dissertation on metaprogramming and programming language design. A metaprogramming model is studied and implemented in a statically–typed pure object– oriented programming language Zero. The object model of language is based on closures which enables metaprogramming model to achieve a high degree of dynamic manipulation, normally only found in ...
متن کاملDirectional Type Checking of Logic Programs
We present an algorithm for automatic type checking of logic programs with respect to directional types that describe both the structure of terms and the directionality of predicates. The type checking problem is reduced to a decidable problem on systems of inclusion constraints over set expressions. We discuss some properties of the reduction algorithm, complexity, and present a proof of corre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1992
ISSN: 0743-1066
DOI: 10.1016/0743-1066(92)90046-6